Optimal rectangular partitions
نویسندگان
چکیده
منابع مشابه
Optimal Hierarchical Partitions for Fractal Image Compression
In fractal image compression a partitioning of the image is required. In this paper we discuss the construction of rate-distortion optimal partitions. We begin with a fine scale partition which gives a fractal encoding with a high bit rate and a low distortion. The partition is hierarchical, thus, corresponds to a tree. We employ a pruning strategy based on the generalized BFOS algorithm. It ex...
متن کاملSimplicial Lipschitz optimization without the Lipschitz constant
In this paper we propose a new simplicial partition-based deterministic algorithm for global optimization of Lipschitz-continuous functions without requiring any knowledge of the Lipschitz constant. Our algorithm is motivated by the well-known Direct algorithm which evaluates the objective function on a set of points that tries to cover the most promising subregions of the feasible region. Almo...
متن کاملInproved Bounds for Rectangular and Guillotine Partitions
We study the problem of partitioning a rectangle S with a set of interior points Q into rectangles by introducing a set of line segments of least total length. The set of partitioning line segments must include every point in Q. Since this prob/em is computationally intractable (NP-hard), several approximation algorithms for its solution have been developed. In this paper we show that the lengt...
متن کاملLoad-Balancing Spatially Located Computations using Rectangular Partitions
Distributing spatially located heterogeneous workloads is an important problem in parallel scientific computing. We investigate the problem of partitioning such workloads (represented as a matrix of non-negative integers) into rectangles, such that the load of the most loaded rectangle (processor) is minimized. Since finding the optimal arbitrary rectangle-based partition is an NP-hard problem,...
متن کاملOn Optimal Guillotine Partitions Approximating Optimal D-box Partitions
Given a set of n points, P, in E d (the plane when d = 2) that lie inside a d-box (rectangle when d = 2) R, we study the problem of partitioning R into d-boxes by introducing a set of orthogonal hyperplane segments (line segments when d = 2) whose total (d?1)-volume (length when d = 2) is the least possible. In a valid d-box partition, each point in P must be included in at least one partitioni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 41 شماره
صفحات -
تاریخ انتشار 2003